Approximating Piecewise-Smooth Functions

نویسندگان

  • Yaron Lipman
  • David Levin
چکیده

We consider the possibility of using locally supported quasi-interpolation operators for the approximation of univariate non-smooth functions. In such a case one usually expects the rate of approximation to be lower than that of smooth functions. It is shown in this paper that prior knowledge of the type of ’singularity’ of the function can be used to regain the full approximation power of the quasi-interpolation method. The singularity types may include jumps in the derivatives at unknown locations, or even singularities of the form (x− s)α , with unknown s and α . The new approximation strategy includes singularity detection and high-order evaluation of the singularity parameters, such as the above s and α . Using the acquired singularity structure, a correction of the primary quasi-interpolation approximation is computed, yielding the final high-order approximation. The procedure is local, and the method is also applicable to a non-uniform data-point distribution. The paper includes some examples illustrating the high performance of the suggested method, supported by an analysis proving the approximation rates in some of the interesting cases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximating the jump discontinuities of a function by its Fourier-Jacobi coefficients

In the present paper we generalize Eckhoff’s method, i.e., the method for approximating the locations of discontinuities and the associated jumps of a piecewise smooth function by means of its Fourier-Chebyshev coefficients. A new method enables us to approximate the locations of discontinuities and the associated jumps of a discontinuous function, which belongs to a restricted class of the pie...

متن کامل

Optimal approximation of piecewise smooth functions using deep ReLU neural networks

We study the necessary and sufficient complexity of ReLU neural networks—in terms of depth and number of weights—which is required for approximating classifier functions in an L-sense. As a model class, we consider the set E(R) of possibly discontinuous piecewise C functions f : [−1/2, 1/2] → R, where the different “smooth regions” of f are separated by C hypersurfaces. For given dimension d ≥ ...

متن کامل

Accurate Piecewise Linear Continuous Approximations to One-Dimensional Curves: Error Estimates and Algorithms

Local and global asymptotic L2 error estimates are derived for piecewise linear continuous approximations to smooth one-dimensional curves in R (n ≥ 1). Based on the estimates and an equidistribution strategy, an algorithm to construct a highly accurate piecewise linear approximation to a one-dimensional curve is devised with a special feature of achieving a desired L2 error. By its generality,...

متن کامل

Surfaces with Piecewise Linear Support Functions over Spherical Triangulations

Given a smooth surface patch we construct an approximating piecewise linear structure. More precisely, we produce a mesh for which virtually all vertices have valency three. We present two methods for the construction of meshes whose facets are tangent to the original surface. These two methods can deal with elliptic and hyperbolic surfaces, respectively. In order to describe and to derive the ...

متن کامل

Fast Multilevel Evaluation of 1-D Piecewise Smooth Radial Basis Function Expansions

Radial basis functions (RBFs) are a powerful tool for interpolating/approximating multidimensional scattered data in R. However, a direct evaluation of an n-center RBF expansion at m points requires O(nm) operations, which is prohibitively expensive as n,m increase. We present a new multilevel method for uniformly dense centers and points and d = 1, whose cost is only O(C(n + m)), where C depen...

متن کامل

Piecewise Polynomial Collocation for Integral Equations with a Smooth Kernel on Surfaces in Three Dimensions

We consider solving integral equations on a piecewise smooth surface S in R 3 with a smooth kernel function, using piecewise polynomial collocation interpolation of the surface. The theoretical analysis includes the eeects of the numerical integration of the collocation coeecients and the use of the approximating surface. The resulting order of convergence is higher than had previously been exp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010